Low Power Modulo 2+1 Adder Based on Carry Save Diminished-One Number System

نویسندگان

  • Somayeh Timarchi
  • Omid Kavehei
  • Keivan Navi
چکیده

Modulo 2+1 adders find great applicability in several applications including RNS implementations. This paper presents a new number system called Carry Save Diminished-one for modulo 2+1 addition and a novel addition algorithm for its operands. In this paper, we also present a novel architectures for designing modulo 2+1 adders, based on parallel-prefix carry computation units. CMOS implementations reveal the superiority of the resulting adders against previously reported solutions in terms of implementation area and delay.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Modulo 2n +1 Adder Design

Efficient modulo 2+1 adders are important for several applications including residue number system, digital signal processors and cryptography algorithms. In this paper we present a novel modulo 2+1 addition algorithm for a recently represented number system. The proposed approach is introduced for the reduction of the power dissipated. In a conventional modulo 2+1 adder, all operands have (n+1...

متن کامل

Improved Modulo 2n +1 Adder Design

Efficient modulo 2+1 adders are important for several applications including residue number system, digital signal processors and cryptography algorithms. In this paper we present a novel modulo 2+1 addition algorithm for a recently represented number system. The proposed approach is introduced for the reduction of the power dissipated. In a conventional modulo 2+1 adder, all operands have (n+1...

متن کامل

Diminished-One Modulo (2 + 1) Multiplier Design

A technique, based on the residue number system (RNS) with operands in the diminished-1 number system, has been used in several applications which include digital signal processing (DSP), implementation international data encryption algorithm (IDEA), Fermat number transform (FNT), and so on. For implementation of these techniques, several designs for modulo 2+1 diminished-1 arithmetic blocks ha...

متن کامل

Power efficient Simulation of Diminished-One Modulo 2n+1 Adder Using Circular Carry Selection

In this paper we have find great applicability in RNS implementation for the Diminished-one modulo 2n+1 Adder using Circular Carry Selection (CCS) circuit. This adder presents a modulo addition of different bit values for n = 8, 12, 16, 24, 32, 48, 64. We are using the Diminished-one criteria using Circular Carry Selection (CCS) technique for the proposed modulo adder. The circuit design of pro...

متن کامل

Efficient Fast Sign Detection Algorithm for the RNS Moduli Set

This brief presents a fast sign detection algorithm for the residue number system moduli set {2 n+1 − 1, 2 n − 1, 2 n }. First, a sign detection algorithm for the restricted moduli set is described. The new algorithm allows for parallel implementation and consists exclusively of modulo 2n additions. Then, a sign detection unit for the moduli set {2 n+1 − 1, 2 n − 1, 2 n } is proposed based on t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007